Scheduling Grid Jobs Using Priority Rule Algorithms and Gap Filling Techniques

نویسندگان

  • Zafril Rizal M Azmi
  • Kamalrulnizam Abu Bakar
  • Mohd Shahir Shamsir
  • Wan Manan
  • Abdul Hanan Abdullah
چکیده

Over the past decade, scheduling in grid computing system has been an active research. However, it is still difficult to find an optimal scheduling algorithm in order to achieve load balancing. Gap filling or backfilling is one of the techniques used to optimize First Come First Serve (FCFS) and have been used widely in scheduling area. This paper introduced an improved backfilling technique which not only applied to FCFS but to others Priority Rule algorithms. Experimental results have shown significant improvement compared to the original Priority Rule algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling Jobs through Gap Filling and Optimization Techniques in Computational Grid

Corresponding Author: Omar Dakkak InterNetWorks Research Laboratory, School of Computing, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah, Malaysia Email: [email protected] Abstract: Due to the heterogeneity and complexity in grid computing, classical algorithms may not be able to deal with dynamic jobs properly. In the dynamic mode, incoming jobs reach the scheduler arbitrary. Therefore, ...

متن کامل

Comparison Of Multi-Criteria Scheduling Techniques

This paper proposes a novel schedule-based approach for scheduling a continuous stream of batch jobs on the machines of a computational Grid. Our new solutions represented by dispatching rule Earliest Gap— Earliest Deadline First (EG-EDF) and Tabu search are based on the idea of filling gaps in the existing schedule. EG-EDF rule is able to build the schedule for all jobs incrementally by applyi...

متن کامل

A New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability

Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...

متن کامل

Grid scheduling algorithms for heterogeneous environment

Grids have emerged as paradigms for the next generation parallel and distributed computing. Computational Grid can be defined as large-scale high-performance distributed computing environments that provide access to high-end computational resources. Grid scheduling is the process of scheduling jobs over grid resources. Improving overall system performance with a lower turn around time is an imp...

متن کامل

Grid Jobs Scheduling Improvement Using Priority Rules and Backfilling

Over the past decade, scheduling in grid computing system has been an active research. However, it is still difficult to find an optimal scheduling algorithm to achieve load balancing. Most of the researchers have focus on schedule-based algorithms such as genetic algorithm and particle swarm optimization to solve this problem and us e priority rules algorithms as initial schedule in those algo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011